Comparison of Convolutional Coupled Codes and Partially Systematic Turbo Codes for Medium Code Lengths
نویسندگان
چکیده
Ingmar Land Information and Coding Theory Lab University of Kiel, Germany e-mail: [email protected] http://www.tf.uni-kiel.de/ict Slim Chaoui Institute for Communications Technology Darmstadt University of Technology, Germany e-mail: [email protected] http://www.nesi.e-technik.tu-darmstadt.de Abstract | Two classes of concatenated codes of rate 1/2 and medium code lengths (600, 2000) are considered: convolutional coupled codes and partially systematic turbo codes. As opposed to the classical turbo code (Berrou, Glavieux), which is a systematic code, coupled codes contain no systematic bits and partially systematic turbo codes only some systematic bits. These codes can still be iteratively decoded and they show even better distance properties. This leads to better error rate performances in a wide range of signal-to-noise ratios, especially in the “flattening region”. The two code classes and their performances are presented and compared.
منابع مشابه
An approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملA search for good convolutional codes to be used in the construction of turbo codes
Recursive systematic convolutional encoders have been shown to play a crucial role in the design of turbo codes. We recall some properties of binary convolutional encoders and apply them to a search for good constituent convolutional codes of turbo codes. Tables of the “best” recursive systematic convolutional encoders found are presented for various rates, together with the average bit-error p...
متن کاملTurbo Codes with Non-Systematic Constituent Codes∗
Turbo codes are usually constructed using systematic recursive convolutional codes (SRCC’s) as constituent codes. In this paper, we introduce a new class of turbo codes that uses nonsystematic recursive convolutional codes (NSRCC’s) as constituent codes. A systematic constituent code then becomes a particular case of this more general class. The use of this larger class of constituent codes enh...
متن کاملStudy on methods of the trellis termination of the convolutional codes components of the turbo-codes
This paper makes a comparison in terms of the bit error rate (BER) and frame error rate (FER) versus signal to noise ratio (SNR) between the different methods of the trellis termination of the recursive, systematic, single and double-binary convolutional codes used in turbo-codes. The best four well known termination methods were investigated: circular (tailbiting), single-termination, interlea...
متن کاملSystematic encoders for convolutional codes and their application to turbo codes
Abst rac t Systematic recursive convolutional encoders have been shown to play a crucial role in the design and implementation ofparallel concatenated codes (“turbo codes77). We present here a canonical structure of minimal linear systematic rate k / n encoders and use it in the search for good constituent codes of parallel concatenated codes. Tables of the best encoders for various rates are a...
متن کامل